Timer formulas and decidable metric temporal logic
نویسندگان
چکیده
منابع مشابه
Safety Metric Temporal Logic Is Fully Decidable
Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we consider a fragment of MTL, called Safety MTL, capable of expressing properties such as invariance and time-bounded response. Our main result is that the satisfiability problem for Safety MTL is decidable. This is the first positive decidability result for MTL over timed ω-words that d...
متن کاملA Decidable Temporal Logic for Temporal Prepositions
This paper investigates the connection between temporal logic and the semantics of some temporal expressions in English. Specii-cally, we show how the meanings of English temporal preposition-phrases can be expressed as modal operators in an interval-based temporal logic which we call ETL0. We show how cascaded temporal preposition phrases and temporal preposition phrases with complex complemen...
متن کاملA Decidable Intuitionistic Temporal Logic
We introduce the logic ITLe, an intuitionistic temporal logic based on structures (W,4, S), where 4 is used to interpret intuitionistic implication and S is a 4-monotone function used to interpret temporal modalities. Our main result is that the satisfiability and validity problems for ITLe are decidable. We prove this by showing that the logic enjoys the strong finite model property. In contra...
متن کاملDecidable theories of !-layered metric temporal structures
This paper focuses on decidability problems for metric and layered temporal logics which allow one to model time granularity in various contexts. The decidability of pure metric (non-granular) fragments and of metric temporal logics endowed with nitely many layers has been already proved by reduction to the decidability problem of the well-known theory S1S. In the present work, we prove the dec...
متن کاملA Decidable Temporal Logic of Parallelism
In this paper we shall introduce a simple temporal logic suitable for reasoning about the temporal aspects of parallel universes, parallel processes, distributed systems or multiple agents. We will use a variant of the mosaic method to prove decid-ability of this logic. We also present an axiomatization for this logic but show that it does not have the nite model property. This shows that the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2005
ISSN: 0890-5401
DOI: 10.1016/j.ic.2004.12.002